Random half-integral polytopes
نویسندگان
چکیده
We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive probability — even if the size of the set relative to the total number of half-integral points of the cube tends to 0. The high rank is due to certain obstructions. We determine the exact threshold number, when these obstructions cease to exist.
منابع مشابه
Polytopes from Subgraph Statistics
We study polytopes that are convex hulls of vectors of subgraph densities. Many graph theoretical questions can be expressed in terms of these polytopes, and statisticians use them to understand exponential random graph models. Relations among their Ehrhart polynomials are described, their duals are applied to certify that polynomials are nonnegative, and we find some of their faces. For the ge...
متن کاملMinkowski Sum of Polytopes and Its Normality
In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex polytopes. We also study Minkowski sums of edge polytopes and give a sufficient condition for Minkowski sums of edge polytopes to have IDP.
متن کاملToric manifolds with degenerate dual variety and defect polytopes
Toric manifolds with dual defect are classified. The associated polytopes, called defect polytopes, are proven to be the class of Delzant integral polytopes for which a combinatorial invariant vanishes.
متن کاملOrder-Chain Polytopes
Given two families X and Y of integral polytopes with nice combinatorial and algebraic properties, a natural way to generate new class of polytopes is to take the intersection P = P1 ∩ P2, where P1 ∈ X, P2 ∈ Y . Two basic questions then arise: 1) when P is integral and 2) whether P inherits the “old type” from P1,P2 or has a “new type”, that is, whether P is unimodularly equivalent to some poly...
متن کاملA Weighted Projection Centering Method
An iterative method for finding the center of a linear programming polytope is presented. The method assumes that we start at a feasible interior point and each iterate is obtained as a convex combination of the orthogonal projection on the half spaces defined by the linear inequalities plus a special projections on the same half spaces. The algorithm is particularly suitable for implementation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 39 شماره
صفحات -
تاریخ انتشار 2011